Discrete Time Scale Invariant Markov Processes
نویسنده
چکیده
In this paper we consider a discrete scale invariant Markov process {X(t), t ∈ R} with scale l > 1. We consider to have some fix number of observations in every scale, say T , and to get our samples at discrete points α, k ∈ W, where α is obtained by the equality l = α and W = {0, 1, . . .}. So we provide a discrete time scale invariant Markov (DT-SIM) process X(·) with parameter space {α, k ∈ W}. We present some properties of such a DT-SIM process and we show that the covariance function is characterized by the values of {R j (1), R H j (0), j = 0, 1, . . . , T − 1}, where R H j (k) is the covariance function of jth and (j + k)th observations of the process. We also define the corresponding T -dimensional self-similar Markov process and characterize its covariance matrix. AMS 2000 Subject Classification: 60G18, 60J05, 60G12.
منابع مشابه
ADK Entropy and ADK Entropy Rate in Irreducible- Aperiodic Markov Chain and Gaussian Processes
In this paper, the two parameter ADK entropy, as a generalized of Re'nyi entropy, is considered and some properties of it, are investigated. We will see that the ADK entropy for continuous random variables is invariant under a location and is not invariant under a scale transformation of the random variable. Furthermore, the joint ADK entropy, conditional ADK entropy, and chain rule of this ent...
متن کاملSpectral Analysis of Multi-dimensional Self-similar Markov Processes
In this paper we consider a discrete scale invariant (DSI) process {X(t), t ∈ R} with scale l > 1. We consider to have some fix number of observations in every scale, say T , and to get our samples at discrete points α, k ∈ W where α is obtained by the equality l = α and W = {0, 1, . . .}. So we provide a discrete time scale invariant (DT-SI) process X(·) with parameter space {α, k ∈ W}. We fin...
متن کاملTranslation Invariant Exclusion Processes ( Book in Progress ) c © 2003
1 Markov chains and Markov processes 4 1.1 Discrete-time Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 Continuous-time Markov chains . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.3 General definitions for Markov processes . . . . . . . . . . . . . . . . . . . . 10 1.4 Poisson processes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 1.5 H...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملOptimal Process Control of Symbolic Transfer Functions
Transfer function modeling is a standard technique in classical Linear Time Invariant and Statistical Process Control. The work of Box and Jenkins was seminal in developing methods for identifying parameters associated with classical (r, s, k) transfer functions. Computing systems are often fundamentally discrete and feedback control in these situations may require discrete event systems for mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009